Exact probability of erasure and a decoding algorithm for convolutional codes on the binary erasure channel
نویسندگان
چکیده
Analytic expressions for the exact probability of erasure for systematic, rate-1/2 convolutional codes used to communicate over the binary erasure channel and decoded using the soft-input, soft-output (SISO) and a posteriori probability (APP) algorithms are given. An alternative forward-backward algorithm which produces the same result as the SISO algorithm is also given. This low-complexity implementation, based upon lookup tables, is of interest for systems which use convolutional codes, such as turbo codes.
منابع مشابه
Decoding of 2D convolutional codes over an erasure channel
In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main idea is to reduce the decoding problem of 2D convolutional codes to a problem of decoding a set of associate...
متن کاملFinite-length analysis of low-density parity-check codes on the binary erasure channel
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively. We also give expressions for upper bounds on the average bit and block erasure probab...
متن کاملChapter 11 Burst Erasure Correction of 2 D convolutional codes ∗
In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. In particular, we present a procedure to recover bursts of erasures that are distributed in a diagonal line. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main...
متن کاملOn-the-Fly Maximum-Likelihood Decoding of Raptor Codes over the Binary Erasure Channel
In this letter, we propose an efficient on-the-fly algorithm for maximum-likelihood decoding of Raptor codes used over the binary erasure channel. It is shown that our proposed decoding algorithm can reduce the actual elapsed decoding time by more than two-thirds with respect to an optimized conventional maximum-likelihood decoding. key words: raptor codes, on-the-fly decoding, maximum-likeliho...
متن کاملComplete MDP convolutional codes
Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a certain length. Reverse MDP convolutional codes have the additional advantage that they are suitable for forward and backward decoding algorithms. Beyond th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003